Multiplicities of Character Values of Binary Sidel'nikov-Lempel-Cohn-Eastman Sequences
نویسندگان
چکیده
Binary Sidel’nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we continue the study of [1]. We first express the multiple roots of character polynomials of SLCE sequences into certain kinds of Jacobi sums. Then by making use of Gauss sums and Jacobi sums in the “semiprimitive” case, we derive new divisibility results for SLCE sequences.
منابع مشابه
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel’nikov and Lempel, Cohn, and Eastman. These investigations were originated by Helleseth and Yang and extended by Kyureghyan and Pott. We determine the exact linear complexity of several families of these sequences using well-known results on cyclotomic numbers. Moreover, we prove a general lower...
متن کاملLinear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences
In this correspondence, the linear complexity over of Lempel–Cohn–Eastman (LCE) sequences of period 1 for an odd prime is determined. For = 3 5 and 7, the exact closed-form expressions for the linear complexity over of LCE sequences of period 1 are derived. Further, the trace representations for LCE sequences of period 1 for = 3 and 5 are found by computing the values of all Fourier coefficient...
متن کاملq-ary Lempel–Cohn–Eastman Sequences
In this paper, for a prime p and a positive integer q such that q|pn − 1, we constructed q-ary Lempel– Cohn–Eastman(LCE) sequences with period p − 1. These sequences have maximum autocorrelation magnitude bounded by 4. Particularly, in the case of q = 3, the maximum autocorrelation magnitude of the ternary LCE sequences is 3. And the maximum autocorrelation magnitude of the quaternary LCE seque...
متن کاملOn the non-randomness of maximum Lempel Ziv complexity sequences of finite size
Random sequences attain the highest entropy rate. The estimation of entropy rate for an ergodic source can be done using the Lempel Ziv complexity measure yet, the exact entropy rate value is only reached in the infinite limit. We prove that typical random sequences of finite length fall short of the maximum Lempel-Ziv complexity, contrary to common belief. We discuss that, for a finite length,...
متن کاملProperties of maximum Lempel-Ziv complexity strings
The properties of maximum Lempel-Ziv complexity strings are studied for the binary case. A comparison between MLZs and random strings is carried out. The length profile of both type of sequences show different distribution functions. The non-stationary character of the MLZs are discussed. The issue of sensitiveness to noise is also addressed. An empirical ansatz is found that fits well to the L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1702.05867 شماره
صفحات -
تاریخ انتشار 2017